搜索资源列表
tree
- 用树的应用模拟铁路查询功能。掌握图的邻接表的定义及应用,能够熟练使用邻接表。加强对map容器的理解,能够熟练使用map容器,复习集合和字典的相关知识。理解最短路径问题,并使用Dijkstra算法解决最短路径问题。掌握线形表的使用,并理解优先队列解决问题的过程。利用栈解决需要逆向输出的问题。 -Application of simulation using the tree railway inquiry function. Master graph adjacency list of def
DijkstraTest
- Dijkstra算法及demo实现,目前10万点,20条边,平均搜索时间为3.7秒.-Dijkstra algorithm and the realization demo now 100,000 points, 20 edges, the average search time of 3.7 seconds.
Dijkstra
- 使用DIJKSTAR算法解决多点最短路径,还带文字解说-Dijkstar algorithm used to solve multi-point shortest path, but also with text to explain
migongsuanfa
- 将从迷宫入口到各点的最短路近的集合看作一棵树。用广度遍历 的方法即可找到出口的最短路近。本程序算法思想来源于求图上一点 到其余各点最短路近的Dijkstra算法。-Maze from the entrance point to the most recent collection of short circuit as a tree. Breadth traversal methods used to find the shortest path near exports. Algo
Dijkstra
- Dijkstra算法,解决最短路径问题,由文本文件输入路的长短-Dijkstra algorithm, the shortest path to solve the problem, from a text file input the length of the road
Dijkstra
- Dijkstra最短路算法 .详细中文注释.-Dijkstra shortest path algorithm. Detailed English Notes.
managemant_enquire
- 传统的Dijkstra 算法无疑是解决一般最短路径问题的最优算法,但接下来我们会看到传统的Dijkstra 算法在公交查询系统是不适合的。而我据对公交乘客出行心理调查的统计结果,指出换乘次数最少是乘客出行时考虑的首要因素,所以这里提出一种基于换乘次数最少的公交最短路径算法。 至于公交车的调度,需要同时考虑到公车公司和乘客的利益,必须尽量在满足双方的利益上做出合理的调度。所以这是一个多目标最优的问题。- management
Dijkstra-Shortest-Path
- 一种快速求得最短路径的经典算法,可以在运筹规划或在统筹安排中使用-Express obtained a classic shortest path algorithm, can be planned or in operation in co-ordinating arrangements for the use of
dijkstra.tar
- 实现Dijkstra算法:算法首先打印一个图,然后用户给出一个起始点和终止点,算法就可以给出这两个点之间的最短距离,或提示没有路径。-Implementation Dijkstra algorithm: algorithm first print a map, then give users a starting point and termination point, the algorithm can give these two points the shortest distance b
DIJKSTRAs
- 这是从点S到T找寻最短路径的Dijkstra算法-Find shortest path from point S to piont T for positive weight matrix W by Dijkstra method. This is the fastest routine.
chengshidaoluzuiduanDijkstra
- 城市道路最短路径的Dijkstra算法优化,应用于城市交通规划-Dijkstra
Dijkstra
- 最短路的Dijkstra算法,程序用c#语言实现-The Dijkstra shortest path algorithm, the procedure with c# language implementation
Dijkstra
- Dijkstra算法--c++源代码 单源最短路径问题,或者称为最短路径问题,是要确定从s到V中没一个其他 顶点的距离,这里从顶点s到x的距离定义为从s到x的最短路径问题。-Dijkstra algorithm- c++ source code for single-source shortest path problem, or known as the shortest path problem is to determine V from s to no one other ve
Dijkstra-omp
- C语言和OpenMP编写的可在多核或SMP处理器上进行多线程运行的最短路径算法。可了解多核多线程和OpenMP的并行编程技术。-C language and can be prepared OpenMP or multi-core processors on SMP multi-threading to run the shortest path algorithm. Learn to multi-core multi-thread and OpenMP parallel programming
dijkstra
- Dijkstra算法 邻接表向量实现(求最短路径及具体走法) -Dijkstra algorithm to achieve adjacency list vector (for the shortest path and the specific moves)
Dijkstra
- Dijkstra算法 实现Dijkstra算法。 要求:对有向网络用Dijkstra算法求出单源最短路径。 -Dijkstra algorithm Dijkstra algorithm. Requirements: on the network using Dijkstra algorithm to find single-source shortest path.
Dijkstra
- 最短路径算法 C语言版的 很好用 需要的试试吧-Shortest path algorithm C language version of the well with
dijkstra
- 用C语言实现dijkstra算法-Using C language algorithm dijkstra
Dijkstra
- 利用C++实现的dijkstra算法,希望对大家有帮助-the implementation of dijkstra . share it with friends
dijkstra
- 计算最短路径,根据单源最短路径算法中的Dijkstra‘s算法-computer Dijkstra s shortest path